Decomposition of split-step quantum walks for simulating Majorana modes and edge states
نویسندگان
چکیده
منابع مشابه
Simulating Diffusion with Quantum Walks on Graphs
The path integral method has been an effective approach to solve the Fokker-Planck equation that simulates the evolution of probability distributions in diffusion processes. Yet the major challenges include the memory requirement to store the transition matrix in a fine-grained state space and a small time step required for the accurate estimation of short-time transition probabilities. Previou...
متن کاملSimulating Stochastic Diffusions by Quantum Walks
Stochastic differential equation (SDE) and Fokker-Planck equation (FPE) are two general approaches to describe the stochastic drift-diffusion processes. Solving SDEs relies on the Monte Carlo samplings of individual system trajectory, whereas FPEs describe the time evolution of overall distributions via path integral alike methods. The large state space and required small step size are the majo...
متن کاملProbing neutral Majorana fermion edge modes with charge transport.
We propose two experiments to probe the Majorana fermion edge states that occur at a junction between a superconductor and a magnet deposited on the surface of a topological insulator. Combining two Majorana fermions into a single Dirac fermion on a magnetic domain wall allows the neutral Majorana fermions to be probed with charge transport. We will discuss a novel interferometer for Majorana f...
متن کاملA Bloch Decomposition-Based Split-Step Pseudospectral Method for Quantum Dynamics with Periodic Potentials
We present a new numerical method for accurate computations of solutions to (linear) one-dimensional Schrödinger equations with periodic potentials. This is a prominent model in solid state physics where we also allow for perturbations by nonperiodic potentials describing external electric fields. Our approach is based on the classical Bloch decomposition method, which allows us to diagonalize ...
متن کاملThe edge tenacity of a split graph
The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.052351